Online packet scheduling with bounded delay and lookahead
نویسندگان
چکیده
منابع مشابه
Online Packet Scheduling with Bounded Delay and Lookahead
We study the online bounded-delay packet scheduling problem (PacketScheduling), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the litera...
متن کاملBounded delay packet scheduling in a bounded buffer
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the more realistic situation where the network switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers (Azar and Levy, SWAT’06). Recently, for the case of a single buffer, a ...
متن کاملOnline Scheduling with Lookahead: Multipass Assembly Lines
This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...
متن کاملPacket scheduling with delay and loss differentiation
To support quality of service over the Internet, the Differentiated Services model has been proposed recently by the IETF. In the Differentiated Services model, ¤ows with similar QoS requirements are aggregated into classes in order to counter the scalability problem faced by the Integrated Services model. There have been several models proposed for service differentiation. The relative differe...
متن کاملOnline Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the constraint that the total size of moved jobs is bounded by times the size of the arriving job. Our mai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.01.013